An Infinite Phase-Size BMAP/M/1 Queue and its Application to Secure Group Communication
نویسنده
چکیده
We derive the bounds of the mean queue length of an infinite phase size BMAP/M/1 queue which has anM/M/∞-type phase transition, and use them to evaluate the performance of secure group communication. Secure communication inside a groups on an open network is critical to enhance the internet capability. Extending the usual matrix analysis to the operator analysis, we derive a new estimation of the degradation of secure group communication model.
منابع مشابه
Title: THE M/G/1-TYPE MARKOV CHAIN WITH RESTRICTED TRANSITIONS AND ITS APPLICATION TO QUEUES WITH BATCH ARRIVALS
We consider M/G/1-type Markov chains where a transition that decreases the value of the level triggers the phase to a small subset of the phase space. We show how this structure, referred to as restricted downward transitions, can be exploited to speed-up the computation of the stationary probability vector of the chain. To this end we define a new M/G/1-type Markov chain with a smaller block s...
متن کاملPower Tail Asymptotic Results of a Discrete Time Queue with Long Range Dependent Input
In this paper, we consider a discrete time queueing system fed by a superposition of an ON and OFF source with heavy tail ON periods and geometric OFF periods and a D-BMAP (Discrete Batch Markovian Arrival Process). We study the tail behavior of the queue length distribution and both infinite and finite buffer systems are considered. In the infinite buffer case, we show that the asymptotic tail...
متن کاملBMAP/BMSP/1 Queue with Randomly Varying Environment
This paper studies two stochastic batch Markovian arrival and batch Markovian service single server queue BMAP/BMSP/1 queue Models (A) and (B) with randomly varying k* distinct environments. The arrival process of the queue has matrix representation {Dm i : 0 ≤ m ≤ M} of order ki describing the BMAP and the service process has matrix representation {Sn i : 0 ≤ n ≤ N} of order k′i describing the...
متن کاملTransient Analysis of the Bmap/ph/1 Queue
We derive in this paper the transient queue length and the busy period distributions of a single server queue with phase-type (PH) service times and a batch Markovian arrival process (BMAP). These distributions are obtained by the uniformization technique which gives simple recurrence relations. The main advantage of this technique is that it leads to stable algorithms for which the precision o...
متن کاملMulti-dimensional Transform Inversion with Applications to the Transient M/g/1 Queue
We develop an algorithm for numerically inverting multi-dimensional transforms. Our algorithm applies to any number of continuous variables (Laplace transforms) and discrete variables (generating functions). We use the Fourier-series method; i.e., the inversion formula is the Fourier series of a periodic function constructed by aliasing. This amounts to an application of the Poisson summation f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006